Weak Dominance Drawings and Linear Extension Diameter
نویسندگان
چکیده
We introduce the problem of Weak Dominance Drawing for general directed acyclic graphs and we show the connection with the linear extension diameter of a partial order P . We present complexity results and bounds.
منابع مشابه
The Strength of Weak Proximity ? ( extended
This paper initiates the study of weak proximity drawings of graphs and demonstrates their advantages over strong proximity drawings in certain cases. Weak proximity drawings are straight line drawings such that if the proximity region of two points p and q representing ver-tices is devoid of other points representing vertices, then segment (p; q) is allowed, but not forced, to appear in the dr...
متن کاملAlgorithms and Bounds for Overloaded Orthogonal Drawings
Orthogonal drawings are widely used for graph visualization due to their high clarity and ease of representation. But when it comes to highdegree and massive graphs, even orthogonal drawings have difficulties producing a clean and simple visualization. In this paper we present a technique called Overloaded Orthogonal Drawing that greatly improves the readability by proposing a new vertex placem...
متن کاملOverloaded Orthogonal Drawings
Orthogonal drawings are widely used for graph visualization due to their high clarity of representation. In this paper we present a technique called Overloaded Orthogonal Drawing. We first place the vertices on grid points following a relaxed version of dominance drawing, called weak dominance condition. Edge routing is implied automatically by the vertex coordinates. In order to simplify these...
متن کاملProximity Drawings: Three Dimensions Are Better than Two
We consider weak Gabriel drawings of unbounded degree trees in the three-dimensional space. We assume a minimum distance between any two vertices. Under the same assumption, there exists an exponential area lower bound for general graphs. Moreover, all previously known algorithms to construct (weak) proximity drawings of trees, generally produce exponential area layouts, even when we restrict o...
متن کاملDominance Drawing of Non-Planar Graphs
In information technology, big data is a term used to describe data sets so large and complex that they become awkward to work and analyze. Difficulties include capture, storage, search, sharing, analysis, and visualization. In this work we focus in the latter part, specifically we study the visualization of graphs. The need for simple and intuitive visualization techniques is more imminent tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1108.1439 شماره
صفحات -
تاریخ انتشار 2011